Local Search for Solving Satisfiability of Polynomial Formulas

Augmenting Local Search for Satisfiability

This dissertation explores approaches to the satisfiability problem, focusing on local search methods. The research endeavours to better understand how and why some local search methods are effective. At the root of this understanding are a set of metrics that characterize the behaviour of local search methods. Based on this understanding, two new local search methods are proposed and tested, t...

Backbone Guided Local Search for Maximum Satisfiability

Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of the best local search algorithms designed for SAT, on Max-SAT. We show that Walksat is also effective on Max-SAT, while its effectiveness degrades as the problem is more constrained. We then develop a novel method that e...

Stochastic Local Search for Satisfiability Modulo Theories

Satisfiability Modulo Theories (SMT) is essential for many practical applications, e.g., in hardand software verification, and increasingly also in other scientific areas like computational biology. A large number of applications in these areas benefit from bit-precise reasoning over finite-domain variables. Current approaches in this area translate a formula over bit-vectors to an equisatisfia...

Advances in Local Search for Satisfiability

In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty, draws on the features of two other WalkSAT family algorithms: R+AdaptNovelty and GWSAT, while also successfully employing a dynamic local search (DLS) clause weighting heuristic to further improve performance. gNovelty was a Gold ...

Local search strategies for satisfiability testing